Learning rule ranking by dynamic construction of context-free grammars using AND/OR graphs
نویسندگان
چکیده
منابع مشابه
Learning rule ranking by dyn of context-free grammars usin
This paper discusses a novel approach for the construction of a context-free grammar based on a sequential processing of sentences. The construction of the grammar is based on a search algorithm for the minimum weight subgraph in an AND/OR graph. Aspects of optimality and robustness are discussed. The algorithm plays an essential role in a model for adaptive learning of probabilistic ordering. ...
متن کاملA Program Execution Model Based on Generative Dynamic Grammars
The term “context-free grammar” invariably implies use of a static, unchanging set of grammar rules. When this constraint is removed, dynamic grammars result. In the past, use of dynamic grammars has been relegated to semantics work. However, we show that by defining and interpreting dynamic grammars appropriately, we can create a new grammar-based program execution model. This model unifies di...
متن کاملNCE Graph Grammars and Clique-Width
Graph grammars are widely used in order to deene classes of graphs having some inductive and narrow structure. In many cases the narrowness can be measured in terms of the maximal tree-width and/or clique-width of the graphs in the class, (see RS86],,CO00] for deenitions of these notions). It is known that using the corresponding tree-decomposition or clique-width parse term, any property of th...
متن کاملImproving Grammar Learning Using Seed-Sets
Probabilistic Context-Free Grammars have been unsuccessful in learning natural language, due to the complexity of the task. Considerable research has been conducted into methods of reducing the complexity of PCFG learning. This paper reports the progress of work in extending one particular method of constraining PCFG learning providing partial grammars to improve rule generation. We discuss wha...
متن کاملThe Power of Programmed Grammars with Graphs from Various Classes
Programmed grammars, one of the most important and well investigated classes of grammars with context-free rules and a mechanism controlling the application of the rules, can be described by graphs. We investigate whether or not the restriction to special classes of graphs restricts the generative power of programmed grammars with erasing rules and without appearance checking, too. We obtain th...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2003